On generalized SSOR-like iteration method for saddle point problems
نویسنده
چکیده
In this paper, we study the iterative algorithms for saddle point problems(SPP). We present a new symmetric successive over-relaxation method with three parameters, which is the extension of the SSOR iteration method. Under some suitable conditions, we give the convergence results. Numerical examples further confirm the correctness of the theory and the effectiveness of the method. Key–Words: iterative method, saddle point problems, SOR-like, SSOR-like; symmetric and positive definite matrix
منابع مشابه
A Generalization of Local Symmetric and Skew-symmetric Splitting Iteration Methods for Generalized Saddle Point Problems
In this paper, we further investigate the local Hermitian and skew-Hermitian splitting (LHSS) iteration method and the modified LHSS (MLHSS) iteration method for solving generalized nonsymmetric saddle point problems with nonzero (2,2) blocks. When A is non-symmetric positive definite, the convergence conditions are obtained, which generalize some results of Jiang and Cao [M.-Q. Jiang and Y. Ca...
متن کاملThe effectiveness of HYMLS in the Jacobi-Davidson method for stability analysis of fluid flow problems
We construct, analyze and implement SSOR-like preconditioners for non-Hermitian positive definite system of linear equations when its coefficient matrix possesses either a dominant Hermitian part or a dominant skew-Hermitian part. We derive tight bounds for eigenvalues of the preconditioned matrices and obtain convergence rates of the corresponding SSOR-like iteration methods as well as the cor...
متن کاملOn generalized preconditioned Hermitian and skew-Hermitian splitting methods for saddle point problems
In this paper, we study the iterative algorithms for saddle point problems(SPP). Bai, Golub and Pan recently studied a class of preconditioned Hermitian and skew-Hermitian splitting methods(PHSS). By further accelerating it with another parameters, using the Hermitian/skew-Hermitian splitting iteration technique we present the generalized preconditioned Hermitian and skew-Hermitian splitting me...
متن کاملA Class of Nonsymmetric Preconditioners for Saddle Point Problems Dedicated to Henk A. Van Der Vorst on Occasion of His 60th Birthday
For the iterative solution of saddle point problems, a nonsymmetric preconditioner is studied which, with respect to the upper-left block of the system matrix, can be seen as a variant of SSOR. An idealized situation where SSOR is taken with respect to the skew-symmetric part plus the diagonal part of the upper-left block is analyzed in detail. Since action of the preconditioner involves soluti...
متن کاملGeneralized iterative methods for solving double saddle point problem
In this paper, we develop some stationary iterative schemes in block forms for solving double saddle point problem. To this end, we first generalize the Jacobi iterative method and study its convergence under certain condition. Moreover, using a relaxation parameter, the weighted version of the Jacobi method together with its convergence analysis are considered. Furthermore, we extend a method...
متن کامل